منابع مشابه
Computing Maximum Mean Cuts
Most primal minimum cost network flow (MCNF) algorithms can be seen as variants on cancelling negative augmenting cycles. The analogous view of dual MCNF algorithms is that they cancel positive augmenting cuts. In a companion paper we show that if a dual algorithm chooses to cancel cuts which have the greatest rate of increase in dual objective value per arc, which are called maximum mean cuts,...
متن کاملMaximum Segments and Cuts
In the papers [1, 2, 4–6, 8] the similarities and differences between systems of sequents and systems of natural deduction for some fragments of intuitionistic logic were presented. The main goal of almost all of these papers was to study the connection between cut-free derivations and normal derivations. It is a well-known property that the natural deduction image of a cut-free derivation is a...
متن کاملMaximum Flows and Minimum Cuts
In the mid-1950s, U. S. Air Force researcher Theodore E. Harris and retired U. S. Army general Frank S. Ross published a classified report studying the rail network that linked the Soviet Union to its satellite countries in Eastern Europe. The network was modeled as a graph with 44 vertices, representing geographic regions, and 105 edges, representing links between those regions in the rail net...
متن کاملImage Segmentation With Maximum Cuts
This paper presents an alternative approach to the image segmentation problem. Similar to other recent proposals a graph theoretic framework is used: Given an image a weighted undirected graph is constructed, where each pixel becomes a vertex of the graph and edges measure a relationship between pixels. Our approach differs from previous work in the way we define the edge weights. Typically the...
متن کاملMaximum Flows and Minimum Cuts
In the mid-1950s, U. S. Air Force researcher Theodore E. Harris and retired U. S. Army general Frank S. Ross published a classified report studying the rail network that linked the Soviet Union to its satellite countries in Eastern Europe. The network was modeled as a graph with 44 vertices, representing geographic regions, and 105 edges, representing links between those regions in the rail net...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)00188-r